#include "sort.h"

void test()
{
	/*int arr[] = { 9,2,4,6,1,3,5,8,7,6 };
	InsertSort(arr, sizeof(arr) / sizeof(arr[0]));
	printArray(arr, sizeof(arr) / sizeof(arr[0]));

	int arr1[] = { 9,2,4,6,1,3,5,8,7,6 };
	SelectSort(arr1, sizeof(arr1) / sizeof(arr1[0]));
	printArray(arr1, sizeof(arr1) / sizeof(arr1[0]));

	int arr2[] = { 9,2,4,6,1,3,5,8,7,6 };
	HeapSort(arr2, sizeof(arr2) / sizeof(arr2[0]));
	printArray(arr2, sizeof(arr2) / sizeof(arr2[0]));

	int arr3[] = { 9,2,4,6,1,3,5,8,7,6 };
	ShellSort(arr3, sizeof(arr3) / sizeof(arr3[0]));
	printArray(arr3, sizeof(arr3) / sizeof(arr3[0]));

	int arr4[] = { 9,2,4,6,1,3,5,8,7,6 };
	BubbleSort(arr4, sizeof(arr4) / sizeof(arr4[0]));
	printArray(arr4, sizeof(arr4) / sizeof(arr4[0]));

	int arr5[] = { 9,2,4,6,1,3,5,8,7,6 };
	QuickSort(arr5, 0, sizeof(arr5) / sizeof(arr5[0]) - 1);
	printArray(arr5, sizeof(arr5) / sizeof(arr5[0]));

	int arr6[] = { 9,2,4,6,1,3,5,8,7,6 };
	QuickSortNonR(arr6, 0, sizeof(arr6) / sizeof(arr6[0]) - 1);
	printArray(arr6, sizeof(arr6) / sizeof(arr6[0]));

	int arr7[] = { 9,2,4,6,1,3,5,8,7,6 };
	MergeSort(arr7, sizeof(arr7) / sizeof(arr7[0]));
	printArray(arr7, sizeof(arr7) / sizeof(arr7[0]));*/

	/*int arr[] = { 9,2,4,6,1,3,5,8,7,6 };
	InsertSort(arr, sizeof(arr) / sizeof(arr[0]));
	printArray(arr, sizeof(arr) / sizeof(arr[0]));

	int arr3[] = { 9,2,4,6,1,3,5,8,7,6 };
	ShellSort(arr3, sizeof(arr3) / sizeof(arr3[0]));
	printArray(arr3, sizeof(arr3) / sizeof(arr3[0]));*/
	
	/*int arr[] = { 9,2,4,6,1,3,5,8,7,6 };
	CountSort(arr, sizeof(arr) / sizeof(arr[0]));
	printArray(arr, sizeof(arr) / sizeof(arr[0]));*/

	/*int arr[] = { 9,2,4,6,1,3,5,8,7,6 };
	MergeSortNonR(arr, sizeof(arr) / sizeof(arr[0]));
	printArray(arr, sizeof(arr) / sizeof(arr[0]));*/

	int arr5[] = { 9,2,4,6,1,3,5,8,7,6 };
	QuickSort(arr5, 0, sizeof(arr5) / sizeof(arr5[0]) - 1);
	printArray(arr5, sizeof(arr5) / sizeof(arr5[0]));
}

int main()
{
	test();
	return 0;
}